Independence in CLP languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-valued Action Languages in CLP(FD)

Action description languages, such as A and B (Gelfond and Lifschitz 1998), are expressive instruments introduced for formalizing planning domains and planning problem instances. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains. The approach ...

متن کامل

Structural Information Analysis for CLP Languages

We present the rational construction of a generic domain for structural analysis of CLP languages: Pattern(D]), where the parameter D] is an abstract domain satisfying certain properties. Our domain builds on the parameterized domain for the analysis of Prolog programs Pat(<), which is due to Cortesi et al. [6, 7]. However, the formalization of our CLP abstract domain is independent from specif...

متن کامل

Specialization of Real Life CLP Languages

interpretation [CC77] is a technique for static program analysis in which execution of the program is simulated on a description (or abstract) domain (Dα) which is simpler than the actual (or concrete) domain (D). Values in the description domain and sets of values in the actual domain are related via a pair of monotonic mappings 〈α, γ〉: abstraction α : 2D → Dα and concretization γ : Dα→ 2D whi...

متن کامل

Multivalued Action Languages with Constraints in CLP(FD)

Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains. The approach is then generalized to lift the use of cons...

متن کامل

From Constraint Minimization to Goal Optimization in CLP Languages

In this paper we discuss how the ability of the constraint solvers to deal with constraint minimization can be lifted up to various forms of goal optimization within CLP languages. We emphasis the link there is between optimization and negation both in the declarative semantics and in the operational aspects. We also discuss the design of incremental execution models in an \optimization as inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Programming Languages and Systems

سال: 2000

ISSN: 0164-0925,1558-4593

DOI: 10.1145/349214.349224